Lower Bounds for the Virtual Path Layout Problem in ATM Networks
نویسندگان
چکیده
In this paper we deal with the problem of designing virtual path layouts in ATM networks with given hop-count and minimum load, for which we prove a lower bound with respect to networks with arbitrary topology. The result is then applied to derive a tight lower bound for the one-to-many communication pattern in networks with arbitrary topology, and for the many-to-many communication pattern in planar graphs and graphs with bounded treewidth.
منابع مشابه
Virtual network embedding in the cycle
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a virtual network with a given diameter, which can be embedded in the physical one with a minimum congestion (the congestion is the maximum load of a physical link). Here we solve the problem when the physical network i...
متن کاملPath Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new label switching protocol standardized recently by the IETF. Path layout is essentially the problem of reducing the size of the label-table in a router. The size is equivalent to the number of different paths that pass t...
متن کاملDirected Virtual Path Layouts in ATM Networks
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in nding a set of directed virtual paths (VPs) satisfying some constraints in terms of load (the number of VPs sharing a physical link) and hop count (the number of VPs used to establish a connection). Fo...
متن کاملDimensioning ATM Networks using 2-Layer Hierarchical Virtual Path Layouts
This paper addresses the problem of dimensioning multi-service ATM networks, where each service is supported by a different logical network. In the traditional approach, logical networks are configured with end-to-end VPCs, which greatly simplifies VCC admission control. This approach does not explore resource sharing gains since an end-to-end VPC bandwidth is assigned to each VCC flow. In this...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کامل